Genetic-based search for error-correcting graph isomorphism
نویسندگان
چکیده
Error-correcting graph isomorphism has been found useful in numerous pattern recognition applications. This paper presents a genetic-based search approach that adopts genetic algorithms as the searching criteria to solve the problem of error-correcting graph isomorphism. By applying genetic algorithms, some local search strategies are amalgamated to improve convergence speed. Besides, a selection operator is proposed to prevent premature convergence. The proposed approach has been implemented to verify its validity. Experimental results reveal the superiority of this new technique than several other well-known algorithms.
منابع مشابه
Classical-Sorting Embedded in Genetic Algorithms for Improved Permutation Search
A sorting algorithm defines a path in the search space of n! permutations based on the information provided by a comparison predicate. Our generic mutation operator for hybridization, blends a hill-climber and follows the path traced by any sorting algorithm. Our proposal adds search (exploitation) capability to the mutation operator. Mutation requests swaps to construct and test new permutatio...
متن کاملEfficient Matching and Indexing of Graph Models in Content-Based Retrieval
ÐIn retrieval from image databases, evaluation of similarity, based both on the appearance of spatial entities and on their mutual relationships, depends on content representation based on Attributed Relational Graphs. This kind of modeling entails complex matching and indexing, which presently prevents its usage within comprehensive applications. In this paper, we provide a graphtheoretical fo...
متن کاملError Correcting Graph Matching: On the Influence of the Underlying Cost Function
ÐThis paper investigates the influence of the cost function on the optimal match between two graphs. It is shown that, for a given cost function, there are an infinite number of other cost functions that lead, for any given pair of graphs, to the same optimal error correcting matching. Furthermore, it is shown that well-known concepts from graph theory, such as graph isomorphism, subgraph isomo...
متن کاملFast Error-correcting Graph Isomorphism Based on Model Precompilation
In this paper we present a fast algorithm for the computation of errorcorrecting graph isomorphisms. The new algorithm is an extension of a method for exact subgraph isomorphism detection from an input graph to a set of a priori known model graphs, which was previously developed by the authors. Similarly to the original algorithm, the new method is based on the idea of creating a decision tree ...
متن کاملEpileptic seizure detection based on The Limited Penetrable visibility graph algorithm and graph properties
Introduction: Epileptic seizure detection is a key step for both researchers and epilepsy specialists for epilepsy assessment due to the non-stationariness and chaos in the electroencephalogram (EEG) signals. Current research is directed toward the development of an efficient method for epilepsy or seizure detection based the limited penetrable visibility graph (LPVG) algorith...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEEE transactions on systems, man, and cybernetics. Part B, Cybernetics : a publication of the IEEE Systems, Man, and Cybernetics Society
دوره 27 4 شماره
صفحات -
تاریخ انتشار 1997